例句與造句

1. Common applications for ternary search trees include spell-checking and auto-completion.
2. The above picture is a balanced ternary search tree for the same set of 12 words.
3. However, ternary search trees are more space efficient compared to standard prefix trees, at the cost of speed.
4. As with other trie data structures, each node in a ternary search tree represents a prefix of the stored strings.
5. Like other prefix trees, a ternary search tree can be used as an associative map structure with the ability for incremental string search.
6. It's difficult to find ternary search tree in a sentence. 用ternary search tree造句挺難的
7. The set of children can also be represented as a binary search tree; one instance of this idea is the ternary search tree developed by Sedgewick.
8. In computer science, a "'ternary search tree "'is a type of trie ( sometimes called a " prefix tree " ) where nodes are arranged in a manner similar to a binary search tree, but with up to three children rather than the binary tree's limit of two.